A probabilistic nonequivalence test for syntactic (1,+k)-branching programs
نویسنده
چکیده
We present a satissability test and a probabilistic nonequivalence test for syntactic (1; +k)-branching programs. The satissability test works in time at most O(? 4en k k sd), where s and d are the size and depth of the input branching program. The probabilistic nonequivalence test works in time O(? 12en k k sd log 2 n). The result has consequences also for parity syntactic (1; +k)-branching programs.
منابع مشابه
Complexity theoretical results for randomized branching programs
This work is settled in the area of complexity theory for restricted variants of branching programs. Today, branching programs can be considered one of the standard nonuniform models of computation. One reason for their popularity is that they allow to describe computations in an intuitively straightforward way and promise to be easier to analyze than the traditional models. In complexity theor...
متن کاملLower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)
Randomized branching programs are a probabilistic model of computation defined in analogy to the well-known probabilistic Turing machines. In this paper, we contribute to the complexity theory of randomized read-k-times branching programs. We first consider the case k = 1 and present a function which has nondeterministic read-once branching programs of polynomial size, but for which every rando...
متن کاملA Note on Read-k Times Branching Programs
A syntactic read-k times branching program has the restriction that no variable occurs more than k times on any path (whether or not consistent). We exhibit an explicit Boolean function f; which cannot be computed by nondeterministic syntactic read-k times branching programs of size less than exp p n k 2k ; although its complement :f has a nondeterministic syntactic read-once branching program ...
متن کاملTime-Space Tradeoffs for Branching Programs
We obtain the first non-trivial time-space tradeoff lower bound for functions f : {0, 1}n → {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1 + ǫ)n, for some constant ǫ > 0. We also give the first separation result between the syntactic and semantic read-k models [BRS93] for k > 1 by showin...
متن کاملA Hierarchy for (1, +k)-Branching Programs with Respect of k
Branching programs (b. p.'s) or decision diagrams are a general graph-based model of sequential computation. The b. p.'s of polynomial size are a nonuniform counterpart of LOG. Lower bounds for diierent kinds of restricted b. p.'s are intensively investigated. An important restriction are so called k-b. p.'s, where each computation reads each input bit at most k times. Although, for more restri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 5 شماره
صفحات -
تاریخ انتشار 1998